Probabilistic complexity theory

Results: 385



#Item
321Complexity classes / Probabilistic complexity theory / Analysis of algorithms / PP / Quantum complexity theory / Bounded-error probabilistic polynomial / Randomized algorithm / IP / NP / Theoretical computer science / Computational complexity theory / Applied mathematics

How to Generate and Exchange Secrets (extended abstract)

Add to Reading List

Source URL: www.csee.wvu.edu

Language: English - Date: 2009-04-08 11:29:01
322Complexity classes / NP-hard / P versus NP problem / NP / P / Bounded-error probabilistic polynomial / Oracle machine / Reduction / Time complexity / Theoretical computer science / Computational complexity theory / Applied mathematics

THE P VERSUS NP PROBLEM STEPHEN COOK

Add to Reading List

Source URL: www.claymath.org

Language: English - Date: 2013-08-12 10:39:14
323Analysis of algorithms / Probabilistic complexity theory / Randomized algorithm / IP / Random walk / Markov chain / Quantum Byzantine agreement / Statistics / Theoretical computer science / Probability theory

Noncryptographic Selection Protocols (Extended Abstract) Uriel Feige

Add to Reading List

Source URL: www.disco.ethz.ch

Language: English - Date: 2011-01-19 07:00:55
324Complexity classes / Pseudorandomness / Analysis of algorithms / Probabilistic complexity theory / One-way function / Hard-core predicate / NP / P versus NP problem / Time complexity / Theoretical computer science / Computational complexity theory / Applied mathematics

ICM 2002 • Vol. I • 245^272 Mathematical Foundations of

Add to Reading List

Source URL: www.mathunion.org

Language: English - Date: 2012-04-18 10:56:38
325Complexity classes / Probabilistic complexity theory / Mathematical optimization / NP-complete problems / Probabilistically checkable proof / NP / PCP theorem / P versus NP problem / MAX-3SAT / Theoretical computer science / Computational complexity theory / Applied mathematics

Proceedings of the International Congress of Mathematicians Hyderabad, India, 2010

Add to Reading List

Source URL: www.mathunion.org

Language: English - Date: 2013-04-24 07:33:09
326Probabilistic complexity theory / Polynomials / Pseudorandom number generator / Randomized algorithm / IP / Coding theory / Sipser–Lautemann theorem / Normal distribution / Theoretical computer science / Mathematics / Computational complexity theory

Secure PRNGs from Specialized Polynomial Maps over Any Fq Michael Feng-Hao Liu∗

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2007-10-22 14:34:16
327Joseph Fourier / Representation theory / Applied mathematics / Sipser–Lautemann theorem / Structural complexity theory / Μ operator / Probabilistic complexity theory / Mathematics / Operator theory

Communication Complexity 23 Sept, 2011 (@ TIFR)

Add to Reading List

Source URL: www.tcs.tifr.res.in

Language: English - Date: 2012-11-16 00:22:59
328Complexity classes / Probabilistic complexity theory / Analysis of algorithms / Quantum complexity theory / Bounded-error probabilistic polynomial / PP / Randomized algorithm / Probabilistic Turing machine / Time complexity / Theoretical computer science / Computational complexity theory / Applied mathematics

i Computational Complexity: A Modern

Add to Reading List

Source URL: www.cs.princeton.edu

Language: English - Date: 2007-01-08 22:01:30
329Analysis of algorithms / Search algorithms / Combinatorics / Probabilistic complexity theory / Randomized algorithm / Group testing / Stack / Big O notation / Algorithm / Mathematics / Theoretical computer science / Applied mathematics

What’s Hot and What’s Not: Tracking Most Frequent Items Dynamically Graham Cormode

Add to Reading List

Source URL: www.cs.princeton.edu

Language: English - Date: 2004-02-04 13:12:41
330Complexity classes / Computational resources / Pseudorandomness / Analysis of algorithms / Advice / Bounded-error probabilistic polynomial / NTIME / Pseudorandom generator / Circuit complexity / Theoretical computer science / Computational complexity theory / Applied mathematics

In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time Russell Impagliazzo∗

Add to Reading List

Source URL: www.math.ias.edu

Language: English - Date: 2003-11-18 15:48:52
UPDATE